An Easy “Hard Problem” for Decision-Theoretic Planning
نویسنده
چکیده
This paper presents a challenge problem for decision-theoretic planners. State-space planners reason globally, building a map of the parts of the world relevant to the planning problem, and then attempt to distill a plan out of the map. A planning problem is constructed that humans find trivial, but no state-space planner can solve. Existing POCL planners cannot solve the problem either, but for a less fundamental reason.
منابع مشابه
D Abstract : Multi - Objective Decision - Theoretic Planning
Decision making is hard. It often requires reasoning about uncertain environments, partial observability and action spaces that are too large to enumerate. In such tasks decisiontheoretic agents can often assist us. In most research on decision-theoretic agents, the desirability of actions and their effects is codified in a scalar reward function. However, many real-world decision problems have...
متن کاملA mixed Bayesian/Frequentist approach in sample size determination problem for clinical trials
In this paper we introduce a stochastic optimization method based ona mixed Bayesian/frequentist approach to a sample size determinationproblem in a clinical trial. The data are assumed to come from a nor-mal distribution for which both the mean and the variance are unknown.In contrast to the usual Bayesian decision theoretic methodology, whichassumes a single decision maker, our method recogni...
متن کاملcient Decision - Theoretic Planning : Techniques and EmpiricalAnalysisPeter
This paper discusses techniques for performing eecient decision-theoretic planning. We give an overview of the drips decision-theoretic reenement planning system, which uses abstraction to eeciently identify optimal plans. We present techniques for automatically generating search control information , which can signiicantly improve the planner's performance. We evaluate the ee-ciency of drips b...
متن کاملA Decision-Theoretic Planning Approach to Synthesizing High-Quality Contract Anytime Algorithms
In this paper, we develop a decision-theoretic planning approach to synthesizing high-quality contract anytime algorithms. Anytime algorithms are considered as time-parameterized probabilistic actions. Given a set of primitive anytime algorithms and their performance prooles, the problem of synthesizing high-quality anytime algorithms is translated to a decision-theoretic planning problem.
متن کاملAbstraction and Approximate Decision-Theoretic Planning
ion and Approximate Decision Theoretic Planning Richard Dearden and Craig Boutiliery Department of Computer Science University of British Columbia Vancouver, British Columbia CANADA, V6T 1Z4 email: dearden,[email protected] Abstract Markov decision processes (MDPs) have recently been proposed as useful conceptual models for understanding decision-theoretic planning. However, the utility of the as...
متن کامل